Erratum to: Which Path to Choose in Sequential Gaussian Simulation
نویسندگان
چکیده
منابع مشابه
Application of Sequential Gaussian Conditional Simulation to Underground Mine Design Under Grade Uncertainty
In mining projects, all uncertainties associated with a project must be considered to determine the feasibility study. Grade uncertainty is one of the major components of technical uncertainty that affects the variability of the project. Geostatistical simulation, as a reliable approach, is the most widely used method to quantify risk analysis to overcome the drawbacks of the estimation methods...
متن کاملWhich dialyser membrane to choose?
human erythropoietin causing pure red cell aplasia. Clin Nephrol 1997; 47: 331–335 8. Casadevall N, Nataf J, Viron B et al. Pure red-cell aplasia and antierythropoietin antibodies in patients treated with recombinant erythropoietin. N Engl J Med 2002; 346: 469–475 9. Bunn HF. Drug-induced autoimmune red-cell aplasia [Letter]. N Engl J Med 2002; 346: 522–523 10. Weber G, Gross J, Kromminga A et ...
متن کاملFourier's Elimination: Which to Choose?
1.1 Abstract This paper is concerned with variable elimination methods in linear in-equation systems, related to Fourier's elimination8]. Our aim is to make visible the links between the diierent contributions of S.N. Yap 14]. We show that the three methods proposed by Cernikov, Kolher and Imbert produce exactly the same output (without more or less redundant inequations), up to multiplying by ...
متن کاملUser Experience Evaluation - Which Method to Choose?
User experience has many dimensions and therefore, it is tricky to evaluate it. When the goal of user experience evaluation is to investigate how people feel about using an interactive system, the traditional usability methods are hardly applicable. In this tutorial, we introduce a set of 78 user experience evaluation methods that we have been collecting from the user experience community 2008-...
متن کاملFully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In this paper we describe two implementations of persistent graphs and compare their running times on different graph problems. Both data structures essentially represent graphs as adjacency lists. The first uses the versi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Geosciences
سال: 2017
ISSN: 1874-8961,1874-8953
DOI: 10.1007/s11004-017-9703-0